A Computational Method for Resolving Ambiguities in Coordinate Structures
نویسندگان
چکیده
This paper describes a method for determining syntactic structure in coordinate constructions. It is based on the information taken from semantic similarities, selectional restrictions, and some other linguistic cues. We discuss the role the information plays in resolving ambiguities that appear in coordinate constructions, describe the means of acquiring the necessary information automatically from two on-line corpora and a lexical database, and devise two algorithms for disambiguating coordinate constructions. An experiment that follows shows effectiveness of our method and its applicability to resolving ambiguities in some other syntactic structures.
منابع مشابه
Resolving Scope Ambiguity in Coordination with Minimalist Grammars
One of the key problems in computational linguistics is resolving linguistic ambiguities of all kinds. This paper addresses a computational aspect of scope ambiguity in coordinate structures. I adopt a Minimalist Grammars formalism (Stabler, 1997; Stabler and Keenan, 2003; Kobele, 2006) to derive scope ambiguities and suggest a new explanation of scope effects in coordinate structures.
متن کاملGenerative Modeling of Coordination by Factoring Parallelism and Selectional Preferences
We present a unified generative model of coordination that considers parallelism of conjuncts and selectional preferences. Parallelism of conjuncts, which frequently characterizes coordinate structures, is modeled as a synchronized generation process in the generative parser. Selectional preferences learned from a large web corpus provide an important clue for resolving the ambiguities of coord...
متن کاملLow Complexity and High speed in Leading DCD ERLS Algorithm
Adaptive algorithms lead to adjust the system coefficients based on the measured data. This paper presents a dichotomous coordinate descent method to reduce the computational complexity and to improve the tracking ability based on the variable forgetting factor when there are a lot of changes in the system. Vedic mathematics is used to implement the multiplier and the divider in the VFF equatio...
متن کاملEvaluation of the Regularization Algorithm to Decorrelation of Covariance Matrix of Float Ambiguity in Fast Resolution of GPS Ambiguity Parameters
Precise positioning in Real Time Kinematic (RTK) applications depends on the accurate resolution of the phase ambiguities. In RTK positioning, ambiguity parameters are highly correlated, especially when the positioning rate is high. Consequently, application of de-correlation techniques for the accurate resolution of ambiguities is inevitable. Phase ambiguity as positioning observations by the ...
متن کاملResolving Coordinate Structures for Chinese Constituent Parsing
Coordinate structures are linguistic structures consisting of two or more conjuncts, which usually compose into larger constituent as a whole unit. However, the boundary of each conjunct is difficult to identify, which makes it difficult to parse the whole coordinate and larger structures. In labeled data, such as the Penn Chinese Tree Bank (CTB), coordinate structures are not labeled explicitl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998